On Finite-time Computability Preserving Conversions
نویسندگان
چکیده
منابع مشابه
On Finite-time Computability Preserving Conversions
A finite-time computable function is a partial function from Σ to Σ whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion α : X → Y for X,Y ⊂ Σ is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain Σ are extended sliding b...
متن کاملFinite-time transport in volume-preserving flows.
Finite-time transport between distinct flow regions is of great relevance to many scientific applications, yet quantitative studies remain scarce to date. The primary obstacle is computing the evolution of material volumes, which is often infeasible due to extreme interfacial stretching. We present a framework for describing and computing finite-time transport in n-dimensional (chaotic) volume-...
متن کاملOn function spaces and polynomial-time computability
In Computable Analysis, elements of uncountable spaces, such as the real line R, are represented by functions on strings and fed to Turing machines as oracles; or equivalently, they are represented by infinite strings and written on the tapes of Turing machines [Wei00, BHW08]. To obtain reasonable notions of computability and complexity, it is hence important to choose the “right” representatio...
متن کاملDefining Effectiveness Using Finite Sets A Study on Computability
This paper studies effectiveness in the domain of computability. In the context of model-theoretical approaches to effectiveness, where a function is considered effective if there is a model containing a representation of such function, our definition relies on a model provided by functions between finite sets and uses category theory as its mathematical foundations. The model relies on the fac...
متن کاملOn Computability
concepts that cut across different areas of mathematics. Logical formality per se does not facilitate the finding of arguments from given assumptions to a particular conclusion. However, strategic considerations can be formulated (for natural deduction calculi) and help to bridge the gap between assumptions and conclusion, suggesting at least a very rough structure of arguments. These logical s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.025